Path graph

Results: 1083



#Item
691Vertexica: Your Relational Friend for Graph Analytics! Alekh Jindal∗ Samuel Madden∗ Praynaa Rawlani∗ Amol Deshpande⋆

Vertexica: Your Relational Friend for Graph Analytics! Alekh Jindal∗ Samuel Madden∗ Praynaa Rawlani∗ Amol Deshpande⋆

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2014-09-10 16:19:45
692Eurographics Conference on Visualization (EuroVis[removed]R. Borgo, R. Maciejewski, and I. Viola (Editors) STAR – State of The Art Report  The State of the Art in Visualizing Dynamic Graphs

Eurographics Conference on Visualization (EuroVis[removed]R. Borgo, R. Maciejewski, and I. Viola (Editors) STAR – State of The Art Report The State of the Art in Visualizing Dynamic Graphs

Add to Reading List

Source URL: www.visus.uni-stuttgart.de

Language: English - Date: 2014-04-18 02:58:46
693Optimal Link-state Hop-by-hop Routing Nithin Michael∗ , Ao Tang∗ and Dahai Xu† ∗ ECE Dept., Cornell University, Ithaca, NY 14853, USA. Email: {nm373@,atang@ece.}cornell.edu † AT&T Labs Research, Florham Park, N

Optimal Link-state Hop-by-hop Routing Nithin Michael∗ , Ao Tang∗ and Dahai Xu† ∗ ECE Dept., Cornell University, Ithaca, NY 14853, USA. Email: {nm373@,atang@ece.}cornell.edu † AT&T Labs Research, Florham Park, N

Add to Reading List

Source URL: people.ece.cornell.edu

Language: English - Date: 2013-08-29 18:01:53
694Optimal Link Bombs are Uncoordinated  ∗ Sibel Adalı, Tina Liu, Malik Magdon-Ismail Department of Computer Science, Rensselaer Polytechnic Institute, 110 8th Street, Troy, NY 12180.

Optimal Link Bombs are Uncoordinated ∗ Sibel Adalı, Tina Liu, Malik Magdon-Ismail Department of Computer Science, Rensselaer Polytechnic Institute, 110 8th Street, Troy, NY 12180.

Add to Reading List

Source URL: airweb.cse.lehigh.edu

Language: English - Date: 2005-05-18 10:09:37
695Polynomial-time Algorithms for Enforcing Sequential Consistency in SPMD Programs with Arrays Wei-Yu Chen1 , Arvind Krishnamurthy2 , and Katherine Yelick1 1  Computer Science Division, University of California, Berkeley

Polynomial-time Algorithms for Enforcing Sequential Consistency in SPMD Programs with Arrays Wei-Yu Chen1 , Arvind Krishnamurthy2 , and Katherine Yelick1 1 Computer Science Division, University of California, Berkeley

Add to Reading List

Source URL: upc.lbl.gov

Language: English - Date: 2010-05-06 00:14:41
696ON STABLE CYCLES AND CYCLE DOUBLE COVERS OF GRAPHS WITH LARGE CIRCUMFERENCE JONAS HÄGGLUND AND KLAS MARKSTRÖM Abstract. A cycle C in a graph is called stable if there exist no other cycle D in the same graph such that

ON STABLE CYCLES AND CYCLE DOUBLE COVERS OF GRAPHS WITH LARGE CIRCUMFERENCE JONAS HÄGGLUND AND KLAS MARKSTRÖM Abstract. A cycle C in a graph is called stable if there exist no other cycle D in the same graph such that

Add to Reading List

Source URL: abel.math.umu.se

Language: English - Date: 2013-12-11 09:07:23
697The Mathematica® Journal  Complex System Reliability A Graph Theory Approach Todd Silvestri We demonstrate a method of generating an exact analytical

The Mathematica® Journal Complex System Reliability A Graph Theory Approach Todd Silvestri We demonstrate a method of generating an exact analytical

Add to Reading List

Source URL: www.mathematica-journal.com

Language: English - Date: 2014-06-11 14:44:45
698Even cycle decompositions of 4-regular graphs and line graphs Klas Markstr¨ om Abstract. An even cycle decomposition of a graph is a partition of its edge into even cycles. We first give some results on the existence of

Even cycle decompositions of 4-regular graphs and line graphs Klas Markstr¨ om Abstract. An even cycle decomposition of a graph is a partition of its edge into even cycles. We first give some results on the existence of

Add to Reading List

Source URL: abel.math.umu.se

Language: English - Date: 2013-12-11 09:07:23
699All Friends are Not Equal: Using Weights in Social Graphs to Improve Search Sudheendra Hangal Diana MacLean

All Friends are Not Equal: Using Weights in Social Graphs to Improve Search Sudheendra Hangal Diana MacLean

Add to Reading List

Source URL: xenon.stanford.edu

Language: English - Date: 2011-03-12 01:37:57
700Teacher Guide for Graph Theory Learning Objectives Students will: o Define a mathematical graph, identifying edges and vertices. o Represent real-life situations with mathematical graphs. o Determine which graphs have Eu

Teacher Guide for Graph Theory Learning Objectives Students will: o Define a mathematical graph, identifying edges and vertices. o Represent real-life situations with mathematical graphs. o Determine which graphs have Eu

Add to Reading List

Source URL: math.schaubroeck.net

Language: English - Date: 2012-05-17 15:47:49